On mobile sensor assisted field coverage

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Deployment Algorithms for Field Coverage in Mobile Sensor Networks

In this paper, various sensor deployment strategies are studied for effective coverage in wireless sensor networks. In the proposed algorithms, the sensors find their coverage holes within the corresponding Voronoi polygons. They subsequently move in a direction to minimize (or eliminate) the coverage holes. Novel edge-based and vertex-based strategies are proposed for efficient sensor deployme...

متن کامل

Mobile Robot-Assisted Cellular Environment Coverage

The robotic coverage problem of a known rectangular cellular environment with obstacles is considered in this article. The robot can move only at directions parallel and perpendicular to the sides of the rectangle and can cover one cell at each time unit. A suboptimal minimum-time complete area coverage path-planning algorithm is presented. This algorithm minimizes a distance cost metric relate...

متن کامل

Sensor-Assisted Mobile Phone Localization

0984) Sensor-Assisted Mobile Phone Localization

متن کامل

Randomized Coverage Algorithms for Mobile Sensor Networks

In this work, without exploiting any location and distance information, distributed and randomized algorithms are devised for mitigating the un-coverage problem. These algorithms detect uncovered areas and redundant mobile sensor nodes, and direct them to move to cover the uncovered areas, only basing on the number of neighbors of each node by consuming a small amount of extra control packets. ...

متن کامل

On the Path Coverage by a Non Homogeneous Sensor Field

We analyze the statistical properties of the coverage of a one-dimensional path induced by a two dimensional non homogeneous random sensor network. The sensor locations form a non homogeneous Poisson process and the coverage area of each sensor are circles of random i.i.d. radii. We first describe the onedimensional coverage (sensing) process on the line and describe an equivalent time-inhomoge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Sensor Networks

سال: 2013

ISSN: 1550-4859,1550-4867

DOI: 10.1145/2422966.2422979